Generalized Contingency Analysis Based on Graph Theory and Line Outage Distribution Factor
نویسندگان
چکیده
Identifying the multiple critical components in power systems whose absence together has severe impact on system performance is a crucial problem for known as $(N-x)$ contingency analysis. However, inherent combinatorial feature of notation="LaTeX">$N-x$ analysis incurs by increase notation="LaTeX">$x$ term, making intractable even relatively small test systems. We present new framework identifying contingencies that captures both topology and physics network. Graph theory provides many ways to measure grid graphs, i.e., buses nodes lines edges, allowing researchers characterize structure optimize algorithms. This article proposes scalable approach based group betweenness centrality concept measures electric well line outage distribution factors find loss highest flow The proposed quick efficient solution most networks. validated using various cases, results show able quickly identify result violations.
منابع مشابه
Line outage contingency analysis including the system islanding scenario
The paper describes an algorithm for determining the line outage contingency of a line taking into account of line over load effect in remaining lines and subsequent tripping of over loaded line(s) leading to possible system split or islanding of a power system. The optimally ordered sparse [B 0], [B 00] matrices for the integrated system are used for load flow analysis to determine modified va...
متن کاملSoil and Rock Slope Stability Analysis based on Numerical Manifold Method and Graph Theory
Limit equilibrium method, strength reduction method and Finite Difference Methods are the most prevalently used methods for soil and rock slope stability analysis. However, it can be mention that those have some limitations in practical application. In the Limit equilibrium method, the constitutive model cannot be considered and many assumptions are needed between slices of soil and rock. The s...
متن کاملOn-Line Coloring and Recursive Graph Theory
An on-line vertex coloring algorithm receives the vertices of a graph in some externally determined order, and, whenever a new vertex is presented, the algorithm also learns to which of the previously presented vertices the new vertex is adjacent. As each vertex is received, the algorithm must make an irrevocable choice of a color to assign the new vertex, and it makes this choice without knowl...
متن کاملSegmentation of Magnetic Resonance Brain Imaging Based on Graph Theory
Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...
متن کاملEntropy-based principle and generalized contingency tables
It is well known that the entropy-based concept of mutual information provides a measure of dependence between two discrete random variables. There are several ways to normalize this measure in order to obtain a coefficient similar e.g. to Pearson’s coefficient of contingency. This paper presents a measure of independence between categorical variables and is applied for clustering of multidimen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Systems Journal
سال: 2022
ISSN: ['1932-8184', '1937-9234', '2373-7816']
DOI: https://doi.org/10.1109/jsyst.2021.3089548